Network-coded cooperative information recovery in cellular/802.11 mobile Networks

نویسندگان

  • Yu Liu
  • Bin Guo
  • Chi Zhou
  • Yu Cheng
چکیده

By utilizing free WiFi transmissions, network coded cooperative peer-to-peer (P2P) information repair (NC-CPR) has been proposed to mitigate packet loss incurred during cellular Base Station (BS) broadcast. However, most of the work focuses on static network environment. While considering peer movement, the challenge part is the dynamically changed network topology, making it hard to control the transmission collisions to achieve good repair performance. In this paper, we propose the network coded cooperative information repair protocol with mobility concern (NC-CIRM) to recover the lost packets under the mobile scenario. Peer transmissions are scheduled with different channel access priorities based on their neighborhood information. Then, the NC-CIRM with known distribution (NCCIRMD) protocol is presented which obtains neighborhood information based on the knowledge of node spatial distributions. Simulation results show that these two protocols achieve similar repair performance and work efficiently under both uniform and stationary node spatial distributions. Furthermore, a tunable parameter – coded packet generating rate based repair protocol (TP-RP) is proposed to further improve repair performance when the peers uniformly distribute within the system area. At the mean time, an analytical model is developed, then based on which parameter optimization is studied and theoretical results are derived. Extensive simulation results illustrate the improvement made by TP-RP protocol compared with the other two protocols and validate the accuracy of the optimal value of the tunable parameter. & 2014 Elsevier Ltd. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Cellular Automaton Based Algorithm for Mobile Sensor Gathering

In this paper we proposed a Cellular Automaton based local algorithm to solve the autonomously sensor gathering problem in Mobile Wireless Sensor Networks (MWSN). In this problem initially the connected mobile sensors deployed in the network and goal is gather all sensors into one location. The sensors decide to move only based on their local information. Cellular Automaton (CA) as dynamical sy...

متن کامل

A new SDN-based framework for wireless local area networks

Nowadays wireless networks are becoming important in personal and public communication andgrowing very rapidly. Similarly, Software Dened Network (SDN) is an emerging approach to over-come challenges of traditional networks. In this paper, a new SDN-based framework is proposedto ne-grained control of 802.11 Wireless LANs. This work describes the benets of programmableAcc...

متن کامل

Distributed and Cooperative Compressive Sensing Recovery Algorithm for Wireless Sensor Networks with Bi-directional Incremental Topology

Recently, the problem of compressive sensing (CS) has attracted lots of attention in the area of signal processing. So, much of the research in this field is being carried out in this issue. One of the applications where CS could be used is wireless sensor networks (WSNs). The structure of WSNs consists of many low power wireless sensors. This requires that any improved algorithm for this appli...

متن کامل

A Hidden Node Aware Network Allocation Vector Management System for Multi-hop Wireless Ad hoc Networks

Many performance evaluations for IEEE 802.11distributed coordination function (DCF) have been previouslyreported in the literature. Some of them have clearly indicatedthat 802.11 MAC protocol has poor performance in multi-hopwireless ad hoc networks due to exposed and hidden nodeproblems. Although RTS/CTS transmission scheme mitigatesthese phenomena, it has not been successful in thoroughlyomit...

متن کامل

Improvement of the mechanism of congestion avoidance in mobile networks

Mobile ad hoc network congestion control is a significant problem. Standard mechanism for congestion control (TCP), the ability to run certain features of a wireless network, several mutations are not common. In particular, the enormous changes in the network topology and the joint nature of the wireless network. It also creates significant challenges in mobile ad hoc networks (MANET), density ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Network and Computer Applications

دوره 51  شماره 

صفحات  -

تاریخ انتشار 2015